Large-Scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications
نویسندگان
چکیده
منابع مشابه
Nonconvex Quadratic Optimization, Semidefinite Relaxation, and Applications
Nonconvex Quadratic Optimization, Semidefinite Relaxation, and Applications Zhi-Quan Luo, Wing-Kin Ma, Anthony Man-Cho So, Yinyu Ye, and Shuzhong Zhang 1 Department of Electrical and Computer Engineering, University of Minnesota, MN, USA 2 Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong 3 Department of Systems Engineering and Engineering Management, The Chin...
متن کاملQuadratic maximization and semidefinite relaxation
In this paper we study a class of quadratic maximization problems and their semide nite program ming SDP relaxation For a special subclass of the problems we show that the SDP relaxation provides an exact optimal solution Another subclass which is NP hard guarantees that the SDP relaxation yields an approximate solution with a worst case performance ratio of This is a generalization of the well...
متن کاملSemidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
This paper studies the relationship between the optimal value of a homogeneous quadratic optimization problem and that of its Semidefinite Programming (SDP) relaxation. We consider two quadratic optimization models: (1) min{x∗Cx | x∗Akx ≥ 1, k = 0, 1, ...,m, x ∈ Fn} and (2) max{x∗Cx | x∗Akx ≤ 1, k = 0, 1, ..., m, x ∈ Fn}, where F is either the real field R or the complex field C, and Ak, C are ...
متن کاملA Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
متن کاملSemidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
This paper studies the relationship between the so-called bi-quadratic optimization problem and its semidefinite programming (SDP) relaxation. It is shown that each r -bound approximation solution of the relaxed bi-linear SDP can be used to generate in randomized polynomial time an O(r)-approximation solution of the original bi-quadratic optimization problem, where the constant in O(r) does not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2017
ISSN: 0162-8828,2160-9292
DOI: 10.1109/tpami.2016.2541146